Speeding up Chubanov’s Basic Procedure
نویسنده
چکیده
It is shown that a recently proposed method by Chubanov for solving linear homogeneous systems with positive variables can be improved, both theoretically and computationally.
منابع مشابه
Speeding up Chubanov’s method for solving a homogeneous inequality system
It is shown that a recently proposed method by Chubanov for solving linear homogeneous systems with nonnegative variables can be improved, both theoretically and computationally.
متن کاملOn Chubanov’s method for solving a homogeneous inequality system
We deal with a recently proposed method of Chubanov for solving linear homogeneous systems with positive variables. Our first aim is to show that the performance of this method can be improved by a slight modification of Chubanov’s so-called Basic Procedure. In theory this results in at least the same decrease of the merit function used by Chubanov, but both in theory and in practice the decrea...
متن کاملAn extension of Chubanov’s algorithm to symmetric cones
In this work we present an extension of Chubanov’s algorithm to the case of homogeneous feasibility problems over a symmetric cone K. As in Chubanov’s method for linear feasibility problems, the algorithm consists of a basic procedure and a step where the solutions are confined to the intersection of a half-space and K. Following an earlier work by Kitahara and Tsuchiya on second order cone fea...
متن کاملAn improved version of Chubanov’s method for solving a homogeneous feasibility problem
We deal with a recently proposed method of Chubanov [1] for solving linear homogeneous systems with positive variables. Some improvements of Chubanov’s method and its analysis are presented. We propose a new and simple cut criterion and show that the cuts defined by the new criterion are at least as sharp as in [1]. The new cut criterion reduces the iteration bound for his Basic Procedure by a ...
متن کاملA Polynomial Column-wise Rescaling von Neumann Algorithm
Recently Chubanov proposed a method which solves homogeneous linear equality systems with positive variables in polynomial time. Chubanov’s method can be considered as a column-wise rescaling procedure. We adapt Chubanov’s method to the von Neumann problem, and so we design a polynomial time column-wise rescaling von Neumann algorithm. This algorithm is the first variant of the von Neumann algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014